Hyperverlet: A Symplectic Hypersolver for Hamiltonian Systems
نویسندگان
چکیده
Hamiltonian systems represent an important class of dynamical such as pendulums, molecular dynamics, and cosmic systems. The choice solvers is significant to the accuracy when simulating systems, where symplectic show great significance. Recent advances in neural network-based hypersolvers, though achieve competitive results, still lack symplecity necessary for reliable simulations, especially over long time horizons. To alleviate this, we introduce Hyperverlet, a new hypersolver composing traditional, velocity Verlet solvers. More specifically, propose parameterization networks prove that hyperbolic tangent r-finite expanding set allowable activation functions networks, improving accuracy. Extensive experiments on spring-mass pendulum system justify design choices suggest Hyperverlet outperforms both traditional hypersolvers.
منابع مشابه
Symplectic maps for approximating polynomial Hamiltonian systems.
We study how to approximate polynomial Hamiltonian systems by composition of symplectic maps. Recently, a number of methods preserving the symplectic character have appeared. However, they are not completely satisfactory because, in general, they are computationally expensive, very difficult to obtain or their accuracy is relatively low. The efficiency of a numerical method depends on both its ...
متن کاملSymplectic theory of completely integrable Hamiltonian systems
This paper explains the recent developments on the symplectic theory of Hamiltonian completely integrable systems on symplectic 4-manifolds, compact or not. One fundamental ingredient of these developments has been the understanding of singular affine structures. These developments make use of results obtained by many authors in the second half of the twentieth century, notably Arnold, Duisterm...
متن کاملSymplectic Model Reduction of Hamiltonian Systems
In this paper, a symplectic model reduction technique, proper symplectic decomposition (PSD) with symplectic Galerkin projection, is proposed to save the computational cost for the simplification of large-scale Hamiltonian systems while preserving the symplectic structure. As an analogy to the classical proper orthogonal decomposition (POD)-Galerkin approach, PSD is designed to build a symplect...
متن کاملSymplectic Integration of Constrained Hamiltonian Systems
A Hamiltonian system in potential form (H(q, p) = p'M~ 'p/2 + E(q)) subject to smooth constraints on q can be viewed as a Hamiltonian system on a manifold, but numerical computations must be performed in R" . In this paper, methods which reduce "Hamiltonian differential-algebraic equations" to ODEs in Euclidean space are examined. The authors study the construction of canonical parametrizations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2022
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v36i4.20381